Satisfying General Proximity/Similarity Queries with Metric Trees
نویسنده
چکیده
Uhlmann, J.K.. Satisfying general proximity/similarity queries with metric trees, Information Processing Letters 40 (1991) 175-179. Divide-and-conquer search strategies are described for satisfying proximity queries involving arbitrary distance metrics.
منابع مشابه
New best proximity point results in G-metric space
Best approximation results provide an approximate solution to the fixed point equation $Tx=x$, when the non-self mapping $T$ has no fixed point. In particular, a well-known best approximation theorem, due to Fan cite{5}, asserts that if $K$ is a nonempty compact convex subset of a Hausdorff locally convex topological vector space $E$ and $T:Krightarrow E$ is a continuous mapping, then there exi...
متن کاملSolving similarity joins and range queries in metric spaces with the list of twin clusters
The metric space model abstracts many proximity or similarity problems, where the most frequently considered primitives are range and k-nearest neighbor search, leaving out the similarity join, an extremely important primitive. In fact, despite the great attention that this primitive has received in traditional and even multidimensional databases, little has been done for general metric databas...
متن کاملFaster Proximity Searching in Metric Data
A number of problems in computer science can be solved efficiently with the so called memory based or kernel methods. Among this problems (relevant to the AI community) are multimedia indexing, clustering, non supervised learning and recommendation systems. The common ground to this problems is satisfying proximity queries with an abstract metric database. In this paper we introduce a new techn...
متن کاملProviding a Link Prediction Model based on Structural and Homophily Similarity in Social Networks
In recent years, with the growing number of online social networks, these networks have become one of the best markets for advertising and commerce, so studying these networks is very important. Most online social networks are growing and changing with new communications (new edges). Forecasting new edges in online social networks can give us a better understanding of the growth of these networ...
متن کاملApproximate Similarity Search in Metric Data by Using Region Proximity
The problem of approximated similarity search for the range and nearest neighbor queries is investigated for generic metric spaces. The search speedup is achieved by ignoring data regions with a small, user de ned, proximity with respect to the query. For zero proximity, exact similarity search is performed. The problem of proximity of metric regions is explained and a probabilistic approach is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 40 شماره
صفحات -
تاریخ انتشار 1991